搜索资源列表
dijsktra
- C++实现的dijsktra单源最短路径,拓展开对所有节点的最短路径,有利于学习这个算法-C++ achieve dijsktra single source shortest path, expanding open to all nodes of the shortest path, this algorithm is conducive to learning
gene
- 基因串是由一串有限长度的基因所组成的,其中每一个基因都可以用26个英文大写字母中的一个来表示,不同的字母表示不同的基因类型。一个单独的基因可以生长成为一对新的基因,而可能成长的规则是通过一个有限的成长规则集所决定的。每一个成长的规则可以用三个大写英文字母A1A2A3来描述,这个规则的意思是基因A1可以成长为一对基因A2A3。 用大写字母S来表示一类称作超级基因的基因,因为每一个基因串都是由一串超级基因根据给出的规则所成长出来的。 请写一个程序,读入有限条成长的规则和一些我们想要得到的
algorithm
- 关于常用的几种算法介绍1、单源最短路径;2、递归与分治;3、贪心算法;4、动态规划;5、回溯法;6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
Floyed-Huffman-prim
- 算法设计与分析课程中常用的一些算法,包括Floyed算法,Huffman算法、prim算法,单源最短路径算法,分数背包问题-Algorithm Design and Analysis course some commonly used algorithms, including Floyed algorithm, Huffman algorithm, prim algorithm, single-source shortest path algorithm, fractional knapsac
zuoye1
- Dijkstra最短路径路由算法,也称单源最短路径算法。-Dijkstra shortest path routing algorithm, has also become the single source shortest path algorithm.
zuiduanlujing
- 单源点最短路径课程设计,有完整注释,初学者适用-Single-source shortest path curriculum design, the entire project
yy
- 单源最短路径,通过代码选择计算最短路径,选出最优解-the shortest path of the single point ,use code to choose the shortest path,switch the best result
danyuandian
- 单源点最短路径算法的设计与实现,小型课程设计作业目标-Design and implementation of single-source shortest path algorithm, small course design work goals
tsp_ga2
- 中国34个省会城市的旅行商问题最优求解方案,数据都已给出--traveling salesman algorithm calculates the country s 34 cities outside the single source shortest paths.
HDU-1535-
- 求多源点到单终点的最短路(反向建图),ACM竞赛中应用的小程序。-Seeking multiple sources into a single end-point shortest (reverse construction diagram), ACM contest application applet.
dijkstra
- 数据结构中dijkstra单源最短路径算法-dijkstra single-source shortest path algorithm
tsp_ga
- TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to
Dijkstra
- C++实现贪心算法 Dijkstra 单源最短路径-C++ greedy algorithm of Dijkstra single source shortest path
SPFA-algorithm
- 关于数据结构中单源最短路径算法SPFA算法的简单实现,注释很清晰,适用于初学者。-Simple implementation of the data structure on the single-source shortest path algorithm SPFA algorithm, notes very clear, suitable for beginners.
SPFA
- 求单源最短路径的一种算法,是一种高效的最短路算法.-An algorithm for single-source shortest path,which is an efficient algorithm.
Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for computing the shortest path one node to all other nodes. The main features are the s
pv
- 编写程序完成单处理机系统中的进程调度,要求采用①先进先出;②优先数;③最短作业优先调度算法的进程调度。实验具体包括:首先确定进程控制块的内容,进程控制块的组成方式;然后完成进程创建原语和进程调度原语;最后编写主函数对所做工作进行测试。-Write a program to complete the process scheduling of single processor system, require the use of first in first out (2) priority
Graph-algorithm-and-Matlab-program
- 求单源最短路径的Dijkstra算法的Matlab程序 求Euler回路的Fleury算法的Matlab程序 求最小生成树的Prim算法的Matlab程序 求Huffman树的Matlab程序 最大流算法Matlab程序 求任意两点间最短路的Floyd算法的Matlab程序 -Seeking single-source shortest path Dijkstra algorithm Matlab program Euler circuit Fleury seekin
java
- 是由 Richard Bellman 和 Lester Ford 創立的,求解單源最短路徑問題的一種演算法. 常見的最短路徑問題演算法還有 Dijkstra s algorithm, 且 Dijkstra 演算法不允許路徑的 cost 是負值, 但此演算法不受此限制. 但是如果圖形中有包含 cycle, 且 cycle 上面的 cost 的合為負值, 則此演算法不適合用於此種圖形-By Richard Bellman and Lester Ford founded, single-source
danyuan
- 单源最短路算法,对单源最短路算法做了很好的实现,适合初学者学习。-Single-source shortest